A deterministic algorithm for isolating real roots of a real polynomial
نویسندگان
چکیده
منابع مشابه
A Deterministic Descartes Algorithm for Real Polynomials
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the ...
متن کاملA General Approach to Isolating Roots of a Bitstream Polynomial
We describe a new approach to isolate the roots (either real or complex) of a square-free polynomial F with real coefficients. It is assumed that each coefficient of F can be approximated to any specified error bound and refer to such coefficients as bitstream coefficients. The presented method is exact, complete and deterministic. Compared to previous approaches [10, 12, 23] we improve in two ...
متن کاملInteger Arithmetic Determination of Polynomial Real Roots
f~rmed by an algorith m (detailed below) under which th e degrees no, nl , ... nt of the Pi (x) decrease monotonically. We denote degree drop by d i = ni nj _ 1 ~ 1; we distinguish the lead ing and maximum coefficien t magnitudes of the Pi (x) by Ci = I p\/) I and gi ~ I pI!') I; we deno te the norms of the P;(x) by ej = (~(p\,:»2) 1/2; and we distinguish the degree of the initia l Po(x) by N =...
متن کاملA deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum-Shub-Smale model with square root. It rests upon a derandomization of an algorithm of Beltrán and Pardo and gives a deterministic affirmative answer to Smale’s 17 problem. The main idea is to make us...
متن کاملOn arrangements of real roots of a real polynomial and its derivatives
We prove that all arrangements (consistent with the Rolle theorem and some other natural restrictions) of the real roots of a real polynomial and of its s-th derivative are realizable by real polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2010.09.004